On a Generalization of Kingman's Bounds
نویسنده
چکیده
In this paper we develop a framework for computing upper and lower bounds of an exponential form for a class of single server queueing systems with non-renewal inputs. These bounds generalize Kingman's bounds for queues with renewal inputs.
منابع مشابه
Bounds for a class of stochastic recursive equations
In this note we develop a framework for computing upper and lower bounds of an exponential form for a class of stochastic recursive equations with uniformly recurrent Markov modulated inputs. These bounds generalize Kingman's bounds for queues with renewal inputs.
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملSome properties of the parametric relative operator entropy
The notion of entropy was introduced by Clausius in 1850, and some of the main steps towards the consolidation of the concept were taken by Boltzmann and Gibbs. Since then several extensions and reformulations have been developed in various disciplines with motivations and applications in different subjects, such as statistical mechanics, information theory, and dynamical systems. Fujii and Kam...
متن کاملErgodic Theorems for Stochastic Operators and Discrete Event Networks
We present a survey of the main ergodic theory techniques which are used in the study of iterates of monotone and homogeneous stochastic operators. It is shown that ergodic theorems on discrete event networks (queueing networks and/or Petri nets) are a generalization of these stochastic operator theorems. Kingman's subadditive ergodic Theorem is the key tool for deriving what we call rst order ...
متن کاملKingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem
A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994